Taming the Wild in Impartial Combinatorial Games
نویسنده
چکیده
We introduce a misere quotient semigroup construction in impartial combinatorial game theory, and argue that it is the long-sought natural generalization of the normal-play Sprague-Grundy theory to misere play. Along the way, we illustrate how to use the theory to describe complete analyses of two wild taking and breaking games.
منابع مشابه
Nimbers are inevitable
This article concerns the resolution of impartial combinatorial games, and in particular games that can be split in sums of independent positions. We prove that in order to compute the outcome of a sum of independent positions, it is always more efficient to compute separately the nimbers of each independent position than to develop directly the game tree of the sum. The concept of nimber is th...
متن کاملThree-player impartial games
Past efforts to classify impartial three-player combinatorial games (the theories of Li [3] and Straffin [4]) have made various restrictive assumptions about the rationality of one’s opponents and the formation and behavior of coalitions. One may instead adopt an agnostic attitude towards such issues, and seek only to understand in what circumstances one player has a winning strategy against th...
متن کاملMisère quotients for impartial games
We announce misère-play solutions to several previously-unsolved combinatorial games. The solutions are described in terms of misère quotients—commutative monoids that encode the additive structure of specific misère-play games. We also introduce several advances in the structure theory of misère quotients, including a connection between the combinatorial structure of normal and misère play.
متن کاملCofinite Induced Subgraphs of Impartial Combinatorial Games: An Analysis of CIS-Nim
Given an impartial combinatorial game G, we create a class of related games (CISG) by specifying a finite set of positions in G and forbidding players from moving to those positions (leaving all other game rules unchanged). Such modifications amount to taking cofinite induced subgraphs (CIS) of the original game graph. Some recent numerical/heuristic work has suggested that the underlying struc...
متن کامل